Systems, Apparatuses, and Methods for Strided Load

ABSTRACT

Systems, methods, and apparatuses for strided loads are described. In an embodiment, an instruction to include at least an opcode, a field for at least two packed data source operands, a field for a packed data destination operand, and an immediate is designated as a strided load instruction. This instruction is executed to load packed data elements from the at least two packed data source operands using a stride and storing results of the strided loads in the packed data destination operand starting from a defined position determined in part from the immediate.

FIELD OF INVENTION

The field of invention relates generally to computer processorarchitecture, and, more specifically, to an instruction which whenexecuted causes a particular result.

BACKGROUND

An instruction set, or instruction set architecture (ISA), is the partof the computer architecture related to programming, and may include thenative data types, instructions, register architecture, addressingmodes, memory architecture, interrupt and exception handling, andexternal input and output (I/O). It should be noted that the terminstruction generally refers herein to a macro-instruction—that isinstructions that are provided to the processor for execution—as opposedto micro-instructions or micro-ops—that result from a processor'sdecoder decoding macro-instructions).

The instruction set architecture is distinguished from themicroarchitecture, which is the internal design of the processorimplementing the ISA. Processors with different microarchitectures canshare a common instruction set. For example, Intel Pentium 4 processors,Intel Core processors, and Advanced Micro Devices, Inc. of Sunnyvale CAprocessors implement nearly identical versions of the ×86 instructionset (with some extensions having been added to newer versions), but havedifferent internal designs. For example, the same register architectureof the ISA may be implemented in different ways in differentmicro-architectures using well known techniques, including dedicatedphysical registers, one or more dynamically allocated physical registersusing a register renaming mechanism (e.g., the use of a Register AliasTable (RAT), a Reorder Buffer (ROB) and a retirement register file; theuse of multiple maps and a pool of registers), etc. Unless otherwisespecified, the phrases register architecture, register file, andregister refer to that which is visible to the software/programmer andthe manner in which instructions specify registers. Where specificity isdesired, the adjective logical, architectural, or software visible willbe used to indicate registers/files in the register architecture, whiledifferent adjectives will be used to designate registers in a givenmicro-architecture (e.g., physical register, reorder buffer, retirementregister, register pool).

An instruction set includes one or more instruction formats. A giveninstruction format defines various fields (number of bits, location ofbits) to specify, among other things, the operation to be performed andthe operand(s) on which that operation is to be performed. A giveninstruction is expressed using a given instruction format and specifiesthe operation and the operands. An instruction stream is a specificsequence of instructions, where each instruction in the sequence is anoccurrence of an instruction in an instruction format.

Scientific, financial, auto-vectorized general purpose, RMS(recognition, mining, and synthesis)/visual and multimedia applications(e.g., 2D/3D graphics, image processing, videocompression/decompression, voice recognition algorithms and audiomanipulation) often require the same operation to be performed on alarge number of data items (referred to as “data parallelism”). SingleInstruction Multiple Data (SIMD) refers to a type of instruction thatcauses a processor to perform the same operation on multiple data items.SIMD technology is especially suited to processors that can logicallydivide the bits in a register into a number of fixed-sized dataelements, each of which represents a separate value. For example, thebits in a 64-bit register may be specified as a source operand to beoperated on as four separate 16-bit data elements, each of whichrepresents a separate 16-bit value. As another example, the bits in a256-bit register may be specified as a source operand to be operated onas four separate 64-bit packed data elements (quad-word (Q) size dataelements), eight separate 32-bit packed data elements (double word (D)size data elements), sixteen separate 16-bit packed data elements (word(W) size data elements), or thirty-two separate 8-bit data elements(byte (B) size data elements). This type of data is referred to as thepacked data type or vector data type, and operands of this data type arereferred to as packed data operands or vector operands. In other words,a packed data item or vector refers to a sequence of packed dataelements; and a packed data operand or a vector operand is a source ordestination operand of a SIMD instruction (also known as a packed datainstruction or a vector instruction).

By way of example, one type of SIMD instruction specifies a singlevector operation to be performed on two source vector operands in avertical fashion to generate a destination vector operand (also referredto as a result vector operand) of the same size, with the same number ofdata elements, and in the same data element order. The data elements inthe source vector operands are referred to as source data elements,while the data elements in the destination vector operand are referredto a destination or result data elements. These source vector operandsare of the same size and contain data elements of the same width, andthus they contain the same number of data elements. The source dataelements in the same bit positions in the two source vector operandsform pairs of data elements (also referred to as corresponding dataelements; that is, the data element in data element position 0 of eachsource operand correspond, the data element in data element position 1of each source operand correspond, and so on). The operation specifiedby that SIMD instruction is performed separately on each of these pairsof source data elements to generate a matching number of result dataelements, and thus each pair of source data elements has a correspondingresult data element. Since the operation is vertical and since theresult vector operand is the same size, has the same number of dataelements, and the result data elements are stored in the same dataelement order as the source vector operands, the result data elementsare in the same bit positions of the result vector operand as theircorresponding pair of source data elements in the source vectoroperands. In addition to this exemplary type of SIMD instruction, thereare a variety of other types of SIMD instructions (e.g., that have onlyone or has more than two source vector operands; that operate in ahorizontal fashion; that generate a result vector operand that is of adifferent size, that have a different size of data elements, and/or thathave a different data element order). It should be understood that theterm destination vector operand (or destination operand) is defined asthe direct result of performing the operation specified by aninstruction, including the storage of that destination operand at alocation (be it a register or at a memory address specified by thatinstruction) so that it may be accessed as a source operand by anotherinstruction (by specification of that same location by the anotherinstruction.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and notlimitation in the figures of the accompanying drawings, in which likereferences indicate similar elements and in which:

FIG. 1 illustrates an embodiment of hardware to process a strideloadinstruction;

FIG. 2 illustrates an example of an execution of a strideloadinstruction according to an embodiment;

FIG. 3 illustrates an example of an execution of a strideloadinstruction according to an embodiment;

FIG. 4 illustrates embodiments of the strideload instruction;

FIG. 5 illustrates an embodiment of method performed by a processor toprocess a strideload instruction;

FIG. 6 illustrates an embodiment of the execution portion of the methodperformed by a processor to process a strideload instruction;

FIG. 7 illustrates an embodiment of a pseudocode representation of theexecution of a strideload instruction;

FIGS. 8A-8B are block diagrams illustrating a generic vector friendlyinstruction format and instruction templates thereof according toembodiments of the invention;

FIG. 9 is a block diagram illustrating an exemplary specific vectorfriendly instruction format according to embodiments of the invention;

FIG. 10 is a block diagram of a register architecture according to oneembodiment of the invention;

FIG. 11A is a block diagram illustrating both an exemplary in-orderpipeline and an exemplary register renaming, out-of-orderissue/execution pipeline according to embodiments of the invention;

FIG. 11B is a block diagram illustrating both an exemplary embodiment ofan in-order architecture core and an exemplary register renaming,out-of-order issue/execution architecture core to be included in aprocessor according to embodiments of the invention;

FIGS. 12A-B illustrate a block diagram of a more specific exemplaryin-order core architecture, which core would be one of several logicblocks (including other cores of the same type and/or different types)in a chip;

FIG. 13 is a block diagram of a processor 1300 that may have more thanone core, may have an integrated memory controller, and may haveintegrated graphics according to embodiments of the invention;

FIGS. 14-16 are block diagrams of exemplary computer architectures; and

FIG. 17 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to embodimentsof the invention.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forth.However, it is understood that embodiments of the invention may bepracticed without these specific details. In other instances, well-knowncircuits, structures and techniques have not been shown in detail inorder not to obscure the understanding of this description.

References in the specification to “one embodiment,” “an embodiment,”“an example embodiment,” etc., indicate that the embodiment describedmay include a particular feature, structure, or characteristic, butevery embodiment may not necessarily include the particular feature,structure, or characteristic. Moreover, such phrases are not necessarilyreferring to the same embodiment. Further, when a particular feature,structure, or characteristic is described in connection with anembodiment, it is submitted that it is within the knowledge of oneskilled in the art to affect such feature, structure, or characteristicin connection with other embodiments whether or not explicitlydescribed.

Embodiments detailed herein may apply to the problem of vectorizingloops with loads from arrays of structures. Such pattern is also knownas stride load. For example, consider an array of structures, whichconsists of 3 fields:

typedef struct {    double x;    double y;    double z;    }xyz;    xyz*A;and a with accesses to the fields of consecutive elements of the array:

for(i=0; i<N; i++){    x_local = A[i].x;    y_local = A[i].y;    z_local= A[i].z;    computation(x_local, y_local, z_local); ... }

To vectorize the loop with vector registers of length VL bits having KLelements of a given data type (in the example KL=VL/64, as 64-bitfloating point data is accessed, for VL=512, KL=8) need to gatherelements to a vector register from memory. Elements reside in memorywith a stride 3:

-   x_local_vec=[A[i+7].x:A[i+6].x:A[i+5].x:A[i+4].x:A[i+3].x:A[i+2].x:A[i+1].x:A[i+0].x]-   y_local_vec=[A[i+7].y:A[i+6].y:A[i+5].y:A[i+4].y:A[i+3].y:A[i+2].y:A[i+1].y:A[i+0].y]-   z_local_vec=[A[i+7].z:A[i+6].z:A[i+5].z:A[i+4].z:A[i+3].z:A[i+2].z:A[i+1].z:A[i+0].z]

In an instruction set which has a gather instruction, such loads can bedone by 3 adjacent gathers with the same indexes:

-   x_local_vec=gatherqpd[&A[i+0] +v_index*8]-   y_local_vec=gatherqpd[&A[i+0] +v_index*8+8]-   z_local_vec=gatherqpd[&A[i+0] +v_index*8+16],    where v_index=[21:18:15:12:9:6:3:0]—vector of indexes, which    determine offsets of elements from the base address.

Unfortunately, using gathers may have some drawbacks. For example, thegather implementation itself is more complex than a regular vector load,because indexes are not known in general case and require processing ofpossible exceptions. Thus, performance is not optimal. Additionally, thelocality of x_local, y_local, z_local is not taken into consideration(they may be in the same cache line).

To resolve these problems, a gather-to-shuffle (G2S) optimization may beenabled which loads several consecutive vectors to vector registers andthen shuffles (or permutes) data accordingly to several destinationswith a sequence of permute instructions. In an exemplary case, 3 vectorsof 8 elements should be loaded and permuted to 3 destinations. A problemwith G2S optimization is that permute controls for each destination areunique and need to be generated and preserved in separate vectorregisters for the time of the whole loop execution. A stride can havelarger value (N) and the number of unique permute controls grows asN*(N−1). As such, register pressure is increased dramatically. Forstride 5 one would need 20 registers to hold all the permute controls.The number of permute instructions in sequences also grows.

A stride pattern also may appear in a loop going with increment value>1:

for(i=0; i<N; i+=5){    x_local = B[i];    y_local = B[i+1];    z_local= B[i+2];    u_local = B[i+3];    v_local = B[i+4];   computation(x_local, y_local, z_local, u_local, v_local); ... }

Consider current compiler generated permute sequence for stride 3:

-   vmovdqu32 zmm5, ZMMWORD PTR .L_2il0floatpacket.2[rip]//load permute-   vmovdqu32 zmm4, ZMMWORD PTR .L_2il0floatpacket.3[rip]//controls from-   vmovdqu32 zmm3, ZMMWORD PTR .L_2il0floatpacket.4[rip]//memory before-   vmovdqu32 zmm2, ZMMWORD PTR .L_2il0floatpacket.5[rip]//loop-   vmovdqu32 zmm1, ZMMWORD PTR .L_2il0floatpacket.6[rip]-   vmovdqu32 zmm0, ZMMWORD PTR .L_2il0floatpacket.7[rip]

. . . B1.12:

-   vmovdqu32 zmm8, ZMMWORD PTR [rcx]//load of 3 input vectors-   vmovdqu32 zmm9, ZMMWORD PTR [64+rcx]-   vmovdqu32 zmm11, ZMMWORD PTR [128+rcx]-   vmovaps zmm6, zmm5//restoring overwritten-   vmovaps zmm7, zmm3//permute controls-   vmovaps zmm10, zmm1//here-   vpermi2q zmm6, zmm8, zmm9-   vpermi2q zmm7, zmm8, zmm9-   vpermi2q zmm10, zmm8, zmm9-   vmovaps zmm12, zmm4 //restoring overwritten-   vmovaps zmm13, zmm2 //permute controls-   vmovaps zmm14, zmm0 //here-   vpermi2q zmm12, zmm6, zmm11-   vpermi2q zmm13, zmm7, zmm11-   vpermi2q zmm14, zmm10, zmm11-   cmp eax, r10d-   jb . . . B1.12

There are 6 permute controls and totally 12 instructions for permutationafter 3 vectors are loaded (and plus 6 loads of permute controls frommemory).

With an strideload instruction the sequence will look like:

vmovdqu32 zmm1, ZMMWORD PTR [rcx] //load of 3 input vectors

-   vmovdqu32 zmm2, ZMMWORD PTR [64+rcx]-   vmovdqu32 zmm3, ZMMWORD PTR [128+rcx]-   strideload zmm12, zmm1, zmm2, 010:000:00b//permutation itself-   strideload zmm12, zmm3, zmm3, 010:010:01b-   strideload zmm13, zmm1, zmm2, 010:001:00b-   strideload zmm13, zmm3, zmm3, 010:000:01b-   strideload zmm14, zmm1, zmm2, 010:010:00b-   strideload zmm14, zmm3, zmm3, 010:001:01b

Here 6 instructions are for permutations after 3 loads, no register ispreserved for permute controls and no memory references are for gettingpermute controls.

Detailed herein are embodiments apparatuses, systems, and methods usinga strided load (“strideload”) instruction that when executed by ahardware processor causes a loading of packed data elements from atleast two concatenated packed data source operands (srcM, . . . ,src2,src1) using a stride and storing the results of the strided loads in adestination operand starting from a defined position. The definedposition of the destination is defined by (round*M*KL+offset)/stride.The “round” value is provided by an immediate of the strideloadinstruction. KL is a number of packed data elements in a source (vectorlength (VL) divided by packed data element size). M is the number ofconcatenated source operands. The stride value is at least partiallysupplied by an immediate of the strideload instruction. A starting dataelement position of the concatenated sources is defined by an offset issupplied by an immediate of the strideload instruction. In anembodiment, the immediate is an 8-bit value and bits 7:5 are used tocalculate the stride (the value of these bits plus 1), bits 4:2 providethe offset, and bits 1:0 provide the round. In some embodiments, thestoring is under control of a writemask and a field for the writemask isincluded in the instruction.

FIG. 1 illustrates an embodiment of hardware to process a strideloadinstruction. The illustrated hardware is typically a part of a hardwareprocessor or core such as a part of a central processing unit,accelerator, etc.

A strideload instruction is received by decode circuitry 101. Forexample, the decode circuitry 101 receives this instruction from fetchlogic/circuitry. The strideload stride instruction includes fields fortwo or more source operands (e.g., packed data registers (sometimescalled vector registers)), a destination operand (e.g., a packed dataregister (sometimes called a vector register)), an opcode, and animmediate. In some embodiments, the strideload instruction includes afield for an immediate. More detailed embodiments of instruction formatswill be detailed later.

The decode circuitry 101 decodes the strideload instruction into one ormore operations. In some embodiments, this decoding includes generatinga plurality of micro-operations to be performed by execution circuitry(such as execution circuitry 109). The decode circuitry 101 also decodesinstruction prefixes.

In some embodiments, register renaming, register allocation, and/orscheduling circuitry 103 provides functionality for one or more of: 1)renaming logical operand values to physical operand values (e.g., aregister alias table in some embodiments), 2) allocating status bits andflags to the decoded instruction, and/or 3) scheduling the decodedinstruction for execution on execution circuitry out of an instructionpool (e.g., using a reservation station in some embodiments).

Registers (register file) 105 and memory 107 store data as operands ofthe strideload instruction to be operated on by execution circuitry 109.Exemplary register types include packed data registers, general purposeregisters, and floating point registers. The registers 105 may alsoinclude write mask registers as detailed herein.

Execution circuitry 109 executes the decoded strideload instruction toload packed data elements from at least two concatenated source operands(srcM, . . . , src2, src1) using a stride and store the results of thestrided loads in the destination operand starting from a definedposition. The defined position of the destination is defined by(round*M*KL+offset)/stride. The “round” value is provided by animmediate of the strideload instruction. KL is a number of packed dataelements in a source (vector length (VL) divided by packed data elementsize). M is the number of concatenated source operands. The stride valueis at least partially supplied by an immediate of the strideloadinstruction. A starting data element position of the concatenatedsources is defined by an offset is supplied by an immediate of thestrideload instruction. In an embodiment, the immediate is an 8-bitvalue and bits 7:5 are used to calculate the stride (the value of thesebits plus 1), bits 4:2 provide the offset, and bits 1:0 provide theround. In some embodiments, the storing is under control of a writemaskand a field for the writemask is included in the instruction. In someembodiments, retirement circuitry 111 architecturally commits result(e.g., commits a destination register into the registers 105) andretires the instruction.

FIG. 2 illustrates an example of an execution of a strideloadinstruction according to an embodiment. This example is not meant to belimiting. For example, while this example uses a little endian format,the teachings herein allow for a big endian format execution.

Typically, the number of packed data elements to extract and their sizesis dependent upon the instruction encoding (data element size). As such,a different number of packed data elements such as 2, 4, 8, 16, 32, or64 may be in a packed data source. Packed data destination registersizes include 64-bit, 128-bit, 256-bit, and 512-bit.

In this example, the sources 201 (e.g., packed data registers) include 8packed data elements each. These sources 201 are concatenated for thepurposes of the strided loads. The least significant data elementpositions store a “0”, “2”, and “5” respectively. These values are shownas decimal, however, they are typically stored as binary or hexadecimalvalues.

Load/store circuitry (not shown for ease of understanding) is used toextract data elements from the sources 201 according to a strided valueand initial offset and store them consecutively in the destination 205.

In the round 0 strideload operation, the destination is REG0 and thesources are REG1 and REG2. The immediate is shown as 01000100 in binary.This equates to an offset of 1 (bits 4:2 of the immediate have a valueof 1). The means that the first data element to be chosen is offset 1from the least significant data element of the concatenated sources ofREG1 and REG2. This data element is marked in REG1 and has a value of 0.The stride value to be used is the value of the immediate bits 7:5(which is 010b or 2 in decimal) plus 1, which, in this is example is astride value of 3. The round is found by the two least significant bits1:0 of the immediate and is 0.

The starting point for storing strided values into the destination 205from the concatenated sources REG1 and REG2 is found using the following(round*M*KL+offset)/stride. As noted, the round is 0, the number ofsources M is 2, the offset is 1, and the stride is 3. KL for thisexample is 8 (there are 8 data elements per source register). As such,the starting point for the destination is 0. In this example, only 5data element locations are loaded into the destination 205 as shown forthis round.

In the round 1 strideload operation, the destination is REG0 and thesource is REG3. The immediate is shown as 01000000 in binary. Thisequates to an offset of 0 (bits 4:2 of the immediate have a value of 0).The means that the first data element to be chosen is offset 0 from theleast significant data element of the concatenated source of REG3. Thisdata element is marked in REG3 and has a value of 5. The stride value tobe used is the value of the immediate bits 7:5 (which is 010b or 2 indecimal) plus 1, which, in this is example is a stride value of 3. Theround is found by the two least significant bits 1:0 of the immediateand is 1.

The starting point for storing strided values into the destination 205from the concatenated source REG3 is found using the following(round*M*KL+offset)/stride. As noted, the round is 1, the number ofsources M is 2, the offset is 0, and the stride is 3. KL for thisexample is 8 (there are 8 data elements per source register). As such,the starting point for the destination is 5. In this example, only 3data element locations are loaded into the destination 205 as shown forthis round.

FIG. 3 illustrates an example of an execution of a strideloadinstruction according to an embodiment. This example is not meant to belimiting. For example, while this example uses a little endian format,the teachings herein allow for a big endian format execution.

Typically, the number of packed data elements to extract and their sizesis dependent upon the instruction encoding (data element size). As such,a different number of packed data elements such as 2, 4, 8, 16, 32, or64 may be in a packed data source. Packed data destination registersizes include 64-bit, 128-bit, 256-bit, and 512-bit.

In this example, the sources 301 (e.g., packed data registers) include 8packed data elements each. These sources 301 are concatenated for thepurposes of the strided loads. The least significant data elementpositions store a “0”, “2”, and “5” respectively. These values are shownas decimal, however, they are typically stored as binary or hexadecimalvalues.

Load/store circuitry (not shown for ease of understanding) is used toextract data elements from the sources 301 according to a strided valueand initial offset and store them consecutively in the destination 305.

In the round 0 strideload operation, the destination is REG0 and thesources are REG1 and REG2. The immediate is shown as 01000100 in binary.This equates to an offset of 1 (bits 4:2 of the immediate have a valueof 1). The means that the first data element to be chosen is offset 1from the least significant data element of the concatenated sources ofREG1 and REG2. This data element is marked in REG1 and has a value of 0.The stride value to be used is the value of the immediate bits 7:5(which is 010b or 2 in decimal) plus 1, which, in this is example is astride value of 3. The round is found by the two least significant bits1:0 of the immediate and is 0.

The starting point for storing strided values into the destination 305from the concatenated sources REG1 and REG2 is found using the following(round*M*KL+offset)/stride. As noted, the round is 0, the number ofsources M is 2, the offset is 1, and the stride is 3. KL for thisexample is 8 (there are 8 data elements per source register). As such,the starting point for the destination is 0. However, in this example, awritemask 303 (e.g., a writemask register) is used. In data element (orbit) position 3 of the writemask 303 is a 0 indicating that the stridedvalue will not be written into the destination 305. In this example,only 4 data element locations are loaded into the destination 305 asshown for this round.

In the round 1 strideload operation, the destination is REG0 and thesource is REG3. The immediate is shown as 01000000 in binary. Thisequates to an offset of 0 (bits 4:2 of the immediate have a value of 0).The means that the first data element to be chosen is offset 0 from theleast significant data element of the concatenated source of REG3. Thisdata element is marked in REG3 and has a value of 5. The stride value tobe used is the value of the immediate bits 7:5 (which is 010b or 2 indecimal) plus 1, which, in this is example is a stride value of 3. Theround is found by the two least significant bits 1:0 of the immediateand is 1.

The starting point for storing strided values into the destination 305from the concatenated source REG3 is found using the following(round*M*KL+offset)/stride. As noted, the round is 1, the number ofsources M is 2, the offset is 0, and the stride is 3. KL for thisexample is 8 (there are 8 data elements per source register). As such,the starting point for the destination is 5. Again, in this example, thesame writemask (e.g., the previously detailed writemask register) isused. In data element (or bit) position 5 of the writemask is a 0indicating that the strided value will not be written into thedestination 305. In this example, only 2 data element locations areloaded into the destination 305 as shown for this round.

An embodiment of a format (including fields) for a strideloadinstruction is strideload{B/W/D/Q}{k} DST, SRCM . . . SRC0. In someembodiments, strideload{B/W/D/Q} is the opcode of the instruction.B/W/D/Q indicates the data element sizes of the sources/destination asbyte, word, doubleword, and quadword. DST is a packed data destinationregister and SRCM . . . SRC0 are packed data source registers. K is awritemask that is used in some embodiments as detailed herein.

In some embodiments, the strideload instruction includes a writemaskregister operand. A writemask is used to conditionally controlper-element operations and updating of results. Depending upon theimplementation, the writemask uses merging or zeroing masking.Instructions encoded with a predicate (writemask, write mask, or kregister) operand use that operand to conditionally control per-elementcomputational operation and updating of result to the destinationoperand. The predicate operand is known as the opmask (writemask)register. The opmask is a set of eight architectural registers of sizeMAX_KL (64-bit). Note that from this set of 8 architectural registers,only k1 through k7 can be addressed as predicate operand. k0 can be usedas a regular source or destination but cannot be encoded as a predicateoperand. Note also that a predicate operand can be used to enable memoryfault-suppression for some instructions with a memory operand (source ordestination). As a predicate operand, the opmask registers contain onebit to govern the operation/update to each data element of a vectorregister. In general, opmask registers can support instructions withelement sizes: single-precision floating-point (float32), integerdoubleword(int32), double-precision floating-point (float64), integerquadword (int64). The length of a opmask register, MAX_KL, is sufficientto handle up to 64 elements with one bit per element, i.e. 64 bits. Fora given vector length, each instruction accesses only the number ofleast significant mask bits that are needed based on its data type. Anopmask register affects an instruction at per-element granularity. So,any numeric or non-numeric operation of each data element andper-element updates of intermediate results to the destination operandare predicated on the corresponding bit of the opmask register. In mostembodiments, an opmask serving as a predicate operand obeys thefollowing properties: 1) the instruction's operation is not performedfor an element if the corresponding opmask bit is not set (this impliesthat no exception or violation can be caused by an operation on amasked-off element, and consequently, no exception flag is updated as aresult of a masked-off operation); 2). a destination element is notupdated with the result of the operation if the corresponding writemaskbit is not set. Instead, the destination element value must be preserved(merging-masking) or it must be zeroed out (zeroing-masking); 3) forsome instructions with a memory operand, memory faults are suppressedfor elements with a mask bit of 0. Note that this feature provides aversatile construct to implement control-flow predication as the mask ineffect provides a merging behavior for vector register destinations. Asan alternative the masking can be used for zeroing instead of merging,so that the masked out elements are updated with 0 instead of preservingthe old value. The zeroing behavior is provided to remove the implicitdependency on the old value when it is not needed.

FIG. 4 illustrates embodiments of the strideload instruction includingfields for the opcode 401, packed data destination operand 403, packeddata source operands 405, an immediate 409, and, in some embodiments, awritemask operand 407. In some embodiments, it is not possible toexplicitly encode enough source operands for the instructions. In thoseembodiments, implicit registers may be used (e.g., SRC0 is always aparticular register or specified in general purpose register) or byencoding one source that indicates this register and then next nregisters (for example, when an instruction that takes four sources hasbits indicating SRC0 is an operand that also means that SRC1, SRC2 andSRC3 are the other three sources).

FIG. 5 illustrates an embodiment of method performed by a processor toprocess a strideload instruction.

At 501, an instruction is fetched. For example, a strideload instructionis fetched. The strideload instruction includes fields for an opcode, atleast one packed data source operand, an immediate, and a packed datadestination operand. In some embodiments, the strideload instructionincludes field for a writemask operand. In some embodiments, theinstruction is fetched from an instruction cache.

The fetched instruction is decoded at 503. For example, the fetchedstrideload instruction is decoded by decode circuitry such as thatdetailed herein. In some embodiments, the instruction is decoded intoone or more micro-operations.

Data associated with the source operand of the decoded instruction isretrieved at 505. For example, contiguous elements from memory areaccessed beginning at the source address or a source and/or destinationpacked data register is accessed.

At 507, the decoded instruction is executed by execution circuitry(hardware) such as that detailed herein. For the strideload instruction,the execution will, load packed data elements from at least twoconcatenated packed data source operands (srcM, . . . ,src2, src1) usinga stride and store the results of the strided loads in a destinationoperand starting from a defined position. The defined position of thedestination is defined by (round*M*KL+offset)/stride. The “round” valueis provided by an immediate of the strideload instruction. KL is anumber of packed data elements in a source (vector length (VL) dividedby packed data element size). M is the number of concatenated sourceoperands. The stride value is at least partially supplied by animmediate of the strideload instruction. A starting data elementposition of the concatenated sources is defined by an offset is suppliedby an immediate of the strideload instruction. In an embodiment, theimmediate is an 8-bit value and bits 7:5 are used to calculate thestride (the value of these bits plus 1), bits 4:2 provide the offset,and bits 1:0 provide the round. In some embodiments, the storing isunder control of a writemask and a field for the writemask is includedin the instruction.

In some embodiments, the instruction is committed or retired at 509.

FIG. 6 illustrates an embodiment of the execution portion of the methodperformed by a processor to process a strideload instruction.

At 601, a determination of a number of data elements per packed datasource register, an offset value, and a round value are made, along witha calculation of a stride value. The number of data elements per packeddata source register (KL) is determined by vector length (VL) divided bypacked data element size (typically stated as a part of the opcode ofthe instruction). As detailed above, the instruction includes a fieldfor an immediate which is used to get the other values. In anembodiment, the immediate is an 8-bit value and bits 7:5 are used tocalculate the stride (the value of these bits plus 1), bits 4:2 providethe offset, and bits 1:0 provide the round. The offset is a startingdata element position of the concatenated packed data source registers.

The source registers are concatenated at 603. In some embodiments, atemporary data structure is used for the concatenated result.

A determination of a starting data element position of the packed datadestination register is made at 605. The starting position of the packeddata destination register is defined by (round*M*KL+offset)/stride,where M is the number of concatenated packed data source registers.

At 607, a data element value from the concatenated packed data sourceregisters at the offset data element position is loaded and stored intothe determined starting data element position of the packed datadestination register. In some embodiments, this storage is subject to awritemask.

At 609, a data element value from the concatenated packed data sourceregisters at data element position stride values away from theimmediately preceding loaded data element position is loaded and storedinto the packed data destination register consecutively with theprevious storage. In some embodiments, this storage is subject to awritemask.

A determination is made of if all of the strided data element positionsof the concatenated packed data source registers have been exhausted ismade at 611. If not, then the next strided data element position isloaded, etc. in 609.

If yes, in some embodiments, values in data element positions of thedestination are zeroed at 613.

FIG. 7 illustrates an embodiment of a pseudocode representation of theexecution of a strideload instruction.

The figures below detail exemplary architectures and systems toimplement embodiments of the above. In some embodiments, one or morehardware components and/or instructions described above are emulated asdetailed below, or implemented as software modules.

Embodiments of the instruction(s) detailed above are embodied may beembodied in a “generic vector friendly instruction format” which isdetailed below. In other embodiments, such a format is not utilized andanother instruction format is used, however, the description below ofthe writemask registers, various data transformations (swizzle,broadcast, etc.), addressing, etc. is generally applicable to thedescription of the embodiments of the instruction(s) above.Additionally, exemplary systems, architectures, and pipelines aredetailed below. Embodiments of the instruction(s) above may be executedon such systems, architectures, and pipelines, but are not limited tothose detailed.

An instruction set may include one or more instruction formats. A giveninstruction format may define various fields (e.g., number of bits,location of bits) to specify, among other things, the operation to beperformed (e.g., opcode) and the operand(s) on which that operation isto be performed and/or other data field(s) (e.g., mask). Someinstruction formats are further broken down though the definition ofinstruction templates (or subformats). For example, the instructiontemplates of a given instruction format may be defined to have differentsubsets of the instruction format's fields (the included fields aretypically in the same order, but at least some have different bitpositions because there are less fields included) and/or defined to havea given field interpreted differently. Thus, each instruction of an ISAis expressed using a given instruction format (and, if defined, in agiven one of the instruction templates of that instruction format) andincludes fields for specifying the operation and the operands. Forexample, an exemplary ADD instruction has a specific opcode and aninstruction format that includes an opcode field to specify that opcodeand operand fields to select operands (source1/destination and source2);and an occurrence of this ADD instruction in an instruction stream willhave specific contents in the operand fields that select specificoperands. A set of SIMD extensions referred to as the Advanced VectorExtensions (AVX) (AVX1 and AVX2) and using the Vector Extensions (VEX)coding scheme has been released and/or published (e.g., see Intel® 64and IA-32 Architectures Software Developer's Manual, September 2014; andsee Intel° Advanced Vector Extensions Programming Reference, October2014).

Exemplary Instruction Formats

Embodiments of the instruction(s) described herein may be embodied indifferent formats. Additionally, exemplary systems, architectures, andpipelines are detailed below. Embodiments of the instruction(s) may beexecuted on such systems, architectures, and pipelines, but are notlimited to those detailed.

Generic Vector Friendly Instruction Format

A vector friendly instruction format is an instruction format that issuited for vector instructions (e.g., there are certain fields specificto vector operations). While embodiments are described in which bothvector and scalar operations are supported through the vector friendlyinstruction format, alternative embodiments use only vector operationsthe vector friendly instruction format.

FIGS. 8A-8B are block diagrams illustrating a generic vector friendlyinstruction format and instruction templates thereof according toembodiments of the invention. FIG. 8A is a block diagram illustrating ageneric vector friendly instruction format and class A instructiontemplates thereof according to embodiments of the invention; while FIG.8B is a block diagram illustrating the generic vector friendlyinstruction format and class B instruction templates thereof accordingto embodiments of the invention. Specifically, a generic vector friendlyinstruction format 800 for which are defined class A and class Binstruction templates, both of which include no memory access 805instruction templates and memory access 820 instruction templates. Theterm generic in the context of the vector friendly instruction formatrefers to the instruction format not being tied to any specificinstruction set.

While embodiments of the invention will be described in which the vectorfriendly instruction format supports the following: a 64 byte vectoroperand length (or size) with 32 bit (4 byte) or 64 bit (8 byte) dataelement widths (or sizes) (and thus, a 64 byte vector consists of either16 doubleword-size elements or alternatively, 8 quadword-size elements);a 64 byte vector operand length (or size) with 16 bit (2 byte) or 8 bit(1 byte) data element widths (or sizes); a 32 byte vector operand length(or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8bit (1 byte) data element widths (or sizes); and a 16 byte vectoroperand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit(2 byte), or 8 bit (1 byte) data element widths (or sizes); alternativeembodiments may support more, less and/or different vector operand sizes(e.g., 256 byte vector operands) with more, less, or different dataelement widths (e.g., 128 bit (16 byte) data element widths).

The class A instruction templates in FIG. 8A include: 1) within the nomemory access 805 instruction templates there is shown a no memoryaccess, full round control type operation 810 instruction template and ano memory access, data transform type operation 815 instructiontemplate; and 2) within the memory access 820 instruction templatesthere is shown a memory access, temporal 825 instruction template and amemory access, non-temporal 830 instruction template. The class Binstruction templates in FIG. 8B include: 1) within the no memory access805 instruction templates there is shown a no memory access, write maskcontrol, partial round control type operation 812 instruction templateand a no memory access, write mask control, vsize type operation 817instruction template; and 2) within the memory access 820 instructiontemplates there is shown a memory access, write mask control 827instruction template.

The generic vector friendly instruction format 800 includes thefollowing fields listed below in the order illustrated in FIGS. 8A-8B.

Format field 840—a specific value (an instruction format identifiervalue) in this field uniquely identifies the vector friendly instructionformat, and thus occurrences of instructions in the vector friendlyinstruction format in instruction streams. As such, this field isoptional in the sense that it is not needed for an instruction set thathas only the generic vector friendly instruction format.

Base operation field 842—its content distinguishes different baseoperations.

Register index field 844—its content, directly or through addressgeneration, specifies the locations of the source and destinationoperands, be they in registers or in memory. These include a sufficientnumber of bits to select N registers from a P×Q (e.g. 32×512, 16×128,32×1024, 64×1024) register file. While in one embodiment N may be up tothree sources and one destination register, alternative embodiments maysupport more or less sources and destination registers (e.g., maysupport up to two sources where one of these sources also acts as thedestination, may support up to three sources where one of these sourcesalso acts as the destination, may support up to two sources and onedestination).

Modifier field 846—its content distinguishes occurrences of instructionsin the generic vector instruction format that specify memory access fromthose that do not; that is, between no memory access 805 instructiontemplates (846A) and memory access 820 instruction templates. Memoryaccess operations read and/or write to the memory hierarchy (in somecases specifying the source and/or destination addresses using values inregisters), while non-memory access operations do not (e.g., the sourceand destinations are registers). While in one embodiment this field alsoselects between three different ways to perform memory addresscalculations, alternative embodiments may support more, less, ordifferent ways to perform memory address calculations.

Augmentation operation field 850—its content distinguishes which one ofa variety of different operations to be performed in addition to thebase operation. This field is context specific. In one embodiment of theinvention, this field is divided into a class field 868, an alpha field852, and a beta field 854. The augmentation operation field 850 allowscommon groups of operations to be performed in a single instructionrather than 2, 3, or 4 instructions.

Scale field 860—its content allows for the scaling of the index field'scontent for memory address generation (e.g., for address generation thatuses 2^(scale)*index+base).

Displacement Field 862A—its content is used as part of memory addressgeneration (e.g., for address generation that uses2^(scale)*index+base+displacement.)

Displacement Factor Field 862B—(note that the juxtaposition ofdisplacement field 862A directly over displacement factor field 862Bindicates one or the other is used)—its content is used as part ofaddress generation; it specifies a displacement factor that is to bescaled by the size of a memory access (N)—where N is the number of bytesin the memory access (e.g., for address generation that uses2^(scale)*index+base+scaled displacement). Redundant low-order bits areignored and hence, the displacement factor field's content is multipliedby the memory operands total size (N) in order to generate the finaldisplacement to be used in calculating an effective address. The valueof N is determined by the processor hardware at runtime based on thefull opcode field 874 (described later herein) and the data manipulationfield 854C. The displacement field 862A and the displacement factorfield 862B are optional in the sense that they are not used for the nomemory access 805 instruction templates and/or different embodiments mayimplement only one or none of the two.

Data element width field 864—its content distinguishes which one of anumber of data element widths is to be used (in some embodiments for allinstructions; in other embodiments for only some of the instructions).This field is optional in the sense that it is not needed if only onedata element width is supported and/or data element widths are supportedusing some aspect of the opcodes.

Write mask field 870—its content controls, on a per data elementposition basis, whether that data element position in the destinationvector operand reflects the result of the base operation andaugmentation operation. Class A instruction templates supportmerging-writemasking, while class B instruction templates support bothmerging- and zeroing-writemasking. When merging, vector masks allow anyset of elements in the destination to be protected from updates duringthe execution of any operation (specified by the base operation and theaugmentation operation); in other one embodiment, preserving the oldvalue of each element of the destination where the corresponding maskbit has a 0. In contrast, when zeroing vector masks allow any set ofelements in the destination to be zeroed during the execution of anyoperation (specified by the base operation and the augmentationoperation); in one embodiment, an element of the destination is set to 0when the corresponding mask bit has a 0 value. A subset of thisfunctionality is the ability to control the vector length of theoperation being performed (that is, the span of elements being modified,from the first to the last one); however, it is not necessary that theelements that are modified be consecutive. Thus, the write mask field870 allows for partial vector operations, including loads, stores,arithmetic, logical, etc. While embodiments of the invention aredescribed in which the write mask field's 870 content selects one of anumber of write mask registers that contains the write mask to be used(and thus the write mask field's 870 content indirectly identifies thatmasking to be performed), alternative embodiments instead or additionalallow the mask write field's 870 content to directly specify the maskingto be performed.

Immediate field 872—its content allows for the specification of animmediate. This field is optional in the sense that is it not present inan implementation of the generic vector friendly format that does notsupport immediate and it is not present in instructions that do not usean immediate.

Class field 868—its content distinguishes between different classes ofinstructions. With reference to FIGS. 8A-B, the contents of this fieldselect between class A and class B instructions. In FIGS. 8A-B, roundedcorner squares are used to indicate a specific value is present in afield (e.g., class A 868A and class B 868B for the class field 868respectively in FIGS. 8A-B).

Instruction Templates of Class A

In the case of the non-memory access 805 instruction templates of classA, the alpha field 852 is interpreted as an RS field 852A, whose contentdistinguishes which one of the different augmentation operation typesare to be performed (e.g., round 852A.1 and data transform 852A.2 arerespectively specified for the no memory access, round type operation810 and the no memory access, data transform type operation 815instruction templates), while the beta field 854 distinguishes which ofthe operations of the specified type is to be performed. In the nomemory access 805 instruction templates, the scale field 860, thedisplacement field 862A, and the displacement scale filed 862B are notpresent.

No-Memory Access Instruction Templates—Full Round Control Type Operation

In the no memory access full round control type operation 810instruction template, the beta field 854 is interpreted as a roundcontrol field 854A, whose content(s) provide static rounding. While inthe described embodiments of the invention the round control field 854Aincludes a suppress all floating point exceptions (SAE) field 856 and around operation control field 858, alternative embodiments may supportmay encode both these concepts into the same field or only have one orthe other of these concepts/fields (e.g., may have only the roundoperation control field 858).

SAE field 856—its content distinguishes whether or not to disable theexception event reporting; when the SAE field's 856 content indicatessuppression is enabled, a given instruction does not report any kind offloating-point exception flag and does not raise any floating pointexception handler.

Round operation control field 858—its content distinguishes which one ofa group of rounding operations to perform (e.g., Round-up, Round-down,Round-towards-zero and Round-to-nearest). Thus, the round operationcontrol field 858 allows for the changing of the rounding mode on a perinstruction basis. In one embodiment of the invention where a processorincludes a control register for specifying rounding modes, the roundoperation control field's 850 content overrides that register value.

No Memory Access Instruction Templates—Data Transform Type Operation

In the no memory access data transform type operation 815 instructiontemplate, the beta field 854 is interpreted as a data transform field854B, whose content distinguishes which one of a number of datatransforms is to be performed (e.g., no data transform, swizzle,broadcast).

In the case of a memory access 820 instruction template of class A, thealpha field 852 is interpreted as an eviction hint field 852B, whosecontent distinguishes which one of the eviction hints is to be used (inFIG. 8A, temporal 852B.1 and non-temporal 852B.2 are respectivelyspecified for the memory access, temporal 825 instruction template andthe memory access, non-temporal 830 instruction template), while thebeta field 854 is interpreted as a data manipulation field 854C, whosecontent distinguishes which one of a number of data manipulationoperations (also known as primitives) is to be performed (e.g., nomanipulation; broadcast; up conversion of a source; and down conversionof a destination). The memory access 820 instruction templates includethe scale field 860, and optionally the displacement field 862A or thedisplacement scale field 862B.

Vector memory instructions perform vector loads from and vector storesto memory, with conversion support. As with regular vector instructions,vector memory instructions transfer data from/to memory in a dataelement-wise fashion, with the elements that are actually transferred isdictated by the contents of the vector mask that is selected as thewrite mask.

Memory Access Instruction Templates—Temporal

Temporal data is data likely to be reused soon enough to benefit fromcaching. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Memory Access Instruction Templates—Non-Temporal

Non-temporal data is data unlikely to be reused soon enough to benefitfrom caching in the 1st-level cache and should be given priority foreviction. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Instruction Templates of Class B

In the case of the instruction templates of class B, the alpha field 852is interpreted as a write mask control (Z) field 852C, whose contentdistinguishes whether the write masking controlled by the write maskfield 870 should be a merging or a zeroing.

In the case of the non-memory access 805 instruction templates of classB, part of the beta field 854 is interpreted as an RL field 857A, whosecontent distinguishes which one of the different augmentation operationtypes are to be performed (e.g., round 857A.1 and vector length (VSIZE)857A.2 are respectively specified for the no memory access, write maskcontrol, partial round control type operation 812 instruction templateand the no memory access, write mask control, VSIZE type operation 817instruction template), while the rest of the beta field 854distinguishes which of the operations of the specified type is to beperformed. In the no memory access 805 instruction templates, the scalefield 860, the displacement field 862A, and the displacement scale filed862B are not present.

In the no memory access, write mask control, partial round control typeoperation 810 instruction template, the rest of the beta field 854 isinterpreted as a round operation field 859A and exception eventreporting is disabled (a given instruction does not report any kind offloating-point exception flag and does not raise any floating pointexception handler).

Round operation control field 859A—just as round operation control field858, its content distinguishes which one of a group of roundingoperations to perform (e.g., Round-up, Round-down, Round-towards-zeroand Round-to-nearest). Thus, the round operation control field 859Aallows for the changing of the rounding mode on a per instruction basis.In one embodiment of the invention where a processor includes a controlregister for specifying rounding modes, the round operation controlfield's 850 content overrides that register value.

In the no memory access, write mask control, VSIZE type operation 817instruction template, the rest of the beta field 854 is interpreted as avector length field 859B, whose content distinguishes which one of anumber of data vector lengths is to be performed on (e.g., 128, 256, or512 byte).

In the case of a memory access 820 instruction template of class B, partof the beta field 854 is interpreted as a broadcast field 857B, whosecontent distinguishes whether or not the broadcast type datamanipulation operation is to be performed, while the rest of the betafield 854 is interpreted the vector length field 859B. The memory access820 instruction templates include the scale field 860, and optionallythe displacement field 862A or the displacement scale field 862B.

With regard to the generic vector friendly instruction format 800, afull opcode field 874 is shown including the format field 840, the baseoperation field 842, and the data element width field 864. While oneembodiment is shown where the full opcode field 874 includes all ofthese fields, the full opcode field 874 includes less than all of thesefields in embodiments that do not support all of them. The full opcodefield 874 provides the operation code (opcode).

The augmentation operation field 850, the data element width field 864,and the write mask field 870 allow these features to be specified on aper instruction basis in the generic vector friendly instruction format.

The combination of write mask field and data element width field createtyped instructions in that they allow the mask to be applied based ondifferent data element widths.

The various instruction templates found within class A and class B arebeneficial in different situations. In some embodiments of theinvention, different processors or different cores within a processormay support only class A, only class B, or both classes. For instance, ahigh performance general purpose out-of-order core intended forgeneral-purpose computing may support only class B, a core intendedprimarily for graphics and/or scientific (throughput) computing maysupport only class A, and a core intended for both may support both (ofcourse, a core that has some mix of templates and instructions from bothclasses but not all templates and instructions from both classes iswithin the purview of the invention). Also, a single processor mayinclude multiple cores, all of which support the same class or in whichdifferent cores support different class. For instance, in a processorwith separate graphics and general purpose cores, one of the graphicscores intended primarily for graphics and/or scientific computing maysupport only class A, while one or more of the general purpose cores maybe high performance general purpose cores with out of order executionand register renaming intended for general-purpose computing thatsupport only class B. Another processor that does not have a separategraphics core, may include one more general purpose in-order orout-of-order cores that support both class A and class B. Of course,features from one class may also be implement in the other class indifferent embodiments of the invention. Programs written in a high levellanguage would be put (e.g., just in time compiled or staticallycompiled) into an variety of different executable forms, including: 1) aform having only instructions of the class(es) supported by the targetprocessor for execution; or 2) a form having alternative routineswritten using different combinations of the instructions of all classesand having control flow code that selects the routines to execute basedon the instructions supported by the processor which is currentlyexecuting the code.

Exemplary Specific Vector Friendly Instruction Format

FIG. 9 is a block diagram illustrating an exemplary specific vectorfriendly instruction format according to embodiments of the invention.FIG. 9 shows a specific vector friendly instruction format 900 that isspecific in the sense that it specifies the location, size,interpretation, and order of the fields, as well as values for some ofthose fields. The specific vector friendly instruction format 900 may beused to extend the ×86 instruction set, and thus some of the fields aresimilar or the same as those used in the existing ×86 instruction setand extension thereof (e.g., AVX). This format remains consistent withthe prefix encoding field, real opcode byte field, MOD R/M field, SIBfield, displacement field, and immediate fields of the existing ×86instruction set with extensions. The fields from FIG. 8 into which thefields from FIG. 9 map are illustrated.

It should be understood that, although embodiments of the invention aredescribed with reference to the specific vector friendly instructionformat 900 in the context of the generic vector friendly instructionformat 800 for illustrative purposes, the invention is not limited tothe specific vector friendly instruction format 900 except whereclaimed. For example, the generic vector friendly instruction format 800contemplates a variety of possible sizes for the various fields, whilethe specific vector friendly instruction format 900 is shown as havingfields of specific sizes. By way of specific example, while the dataelement width field 864 is illustrated as a one bit field in thespecific vector friendly instruction format 900, the invention is not solimited (that is, the generic vector friendly instruction format 800contemplates other sizes of the data element width field 864).

The generic vector friendly instruction format 800 includes thefollowing fields listed below in the order illustrated in FIG. 9A.

EVEX Prefix (Bytes 0-3) 902 —is encoded in a four-byte form.

Format Field 840 (EVEX Byte 0, bits [7:0])—the first byte (EVEX Byte 0)is the format field 840 and it contains 0×62 (the unique value used fordistinguishing the vector friendly instruction format in one embodimentof the invention).

The second-fourth bytes (EVEX Bytes 1-3) include a number of bit fieldsproviding specific capability.

REX field 905 (EVEX Byte 1, bits [7-5])—consists of a EVEX.R bit field(EVEX Byte 1, bit [7]-R), EVEX.X bit field (EVEX byte 1, bit [6]-X), and857 BEX byte 1, bit [5]-B). The EVEX.R, EVEX.X, and EVEX.B bit fieldsprovide the same functionality as the corresponding VEX bit fields, andare encoded using 1 s complement form, i.e. ZMMO is encoded as 1111 B,ZMM15 is encoded as 0000 B. Other fields of the instructions encode thelower three bits of the register indexes as is known in the art (rrr,xxx, and bbb), so that Rrrr, Xxxx, and Bbbb may be formed by addingEVEX.R, EVEX.X, and EVEX.B.

REX′ field 810—this is the first part of the REX′ field 810 and is theEVEX.R′ bit field (EVEX Byte 1, bit [4]-R′) that is used to encodeeither the upper 16 or lower 16 of the extended 32 register set. In oneembodiment of the invention, this bit, along with others as indicatedbelow, is stored in bit inverted format to distinguish (in thewell-known ×86 32-bit mode) from the BOUND instruction, whose realopcode byte is 62, but does not accept in the MOD R/M field (describedbelow) the value of 11 in the MOD field; alternative embodiments of theinvention do not store this and the other indicated bits below in theinverted format. A value of 1 is used to encode the lower 16 registers.In other words, R′Rrrr is formed by combining EVEX.R′, EVEX.R, and theother RRR from other fields.

Opcode map field 915 (EVEX byte 1, bits [3:0]-mmmm)—its content encodesan implied leading opcode byte (0F, 0F 38, or 0F 3).

Data element width field 864 (EVEX byte 2, bit [7]-W)—is represented bythe notation EVEX.W. EVEX.W is used to define the granularity (size) ofthe datatype (either 32-bit data elements or 64-bit data elements).

EVEX.vvvv 920 (EVEX Byte 2, bits [6:3]-vvvv)—the role of EVEX.vvvv mayinclude the following: 1) EVEX.vvvv encodes the first source registeroperand, specified in inverted (1s complement) form and is valid forinstructions with 2 or more source operands; 2) EVEX.vvvv encodes thedestination register operand, specified in 1s complement form forcertain vector shifts; or 3) EVEX.vvvv does not encode any operand, thefield is reserved and should contain 1111 b. Thus, EVEX.vvvv field 920encodes the 4 low-order bits of the first source register specifierstored in inverted (1 s complement) form. Depending on the instruction,an extra different EVEX bit field is used to extend the specifier sizeto 32 registers.

EVEX.U 868 Class field (EVEX byte 2, bit [2]-U)—If EVEX.U=0, itindicates class A or EVEX.U0; if EVEX.U=1, it indicates class B orEVEX.U1.

Prefix encoding field 925 (EVEX byte 2, bits [1:0]-pp)—providesadditional bits for the base operation field. In addition to providingsupport for the legacy SSE instructions in the EVEX prefix format, thisalso has the benefit of compacting the SIMD prefix (rather thanrequiring a byte to express the SIMD prefix, the EVEX prefix requiresonly 2 bits). In one embodiment, to support legacy SSE instructions thatuse a SIMD prefix (66H, F2H, F3H) in both the legacy format and in theEVEX prefix format, these legacy SIMD prefixes are encoded into the SIMDprefix encoding field; and at runtime are expanded into the legacy SIMDprefix prior to being provided to the decoder's PLA (so the PLA canexecute both the legacy and EVEX format of these legacy instructionswithout modification). Although newer instructions could use the EVEXprefix encoding field's content directly as an opcode extension, certainembodiments expand in a similar fashion for consistency but allow fordifferent meanings to be specified by these legacy SIMD prefixes. Analternative embodiment may redesign the PLA to support the 2 bit SIMDprefix encodings, and thus not require the expansion.

Alpha field 852 (EVEX byte 3, bit [7]-EH; also known as EVEX.EH,EVEX.rs, EVEX.RL, EVEX.write mask control, and EVEX.N; also illustratedwith α)—as previously described, this field is context specific.

Beta field 854 (EVEX byte 3, bits [6:4]-SSS, also known as EVEX.s₂₋₀,EVEX.r₂₋₀, EVEX.rr1, EVEX.LL0, EVEX.LLB; also illustrated with βββ)—aspreviously described, this field is context specific.

REX′ field 810—this is the remainder of the REX′ field and is theEVEX.V′ bit field (EVEX Byte 3, bit [3]-V′) that may be used to encodeeither the upper 16 or lower 16 of the extended 32 register set. Thisbit is stored in bit inverted format. A value of 1 is used to encode thelower 16 registers. In other words, V′VVVV is formed by combiningEVEX.V′, EVEX.vvvv.

Write mask field 870 (EVEX byte 3, bits [2:0]-kkk)—its content specifiesthe index of a register in the write mask registers as previouslydescribed. In one embodiment of the invention, the specific valueEVEX.kkk=000 has a special behavior implying no write mask is used forthe particular instruction (this may be implemented in a variety of waysincluding the use of a write mask hardwired to all ones or hardware thatbypasses the masking hardware).

Real Opcode Field 930 (Byte 4) is also known as the opcode byte. Part ofthe opcode is specified in this field.

MOD R/M Field 940 (Byte 5) includes MOD field 942, Reg field 944, andR/M field 946. As previously described, the MOD field's 942 contentdistinguishes between memory access and non-memory access operations.The role of Reg field 944 can be summarized to two situations: encodingeither the destination register operand or a source register operand, orbe treated as an opcode extension and not used to encode any instructionoperand. The role of R/M field 946 may include the following: encodingthe instruction operand that references a memory address, or encodingeither the destination register operand or a source register operand.

Scale, Index, Base (SIB) Byte (Byte 6) 950—As previously described, thescale field's 852 content is used for memory address generation. SIB.xxx954 and SIB.bbb 956—the contents of these fields have been previouslyreferred to with regard to the register indexes Xxxx and Bbbb.

Displacement field 862A (Bytes 7-10)—when MOD field 942 contains 10,bytes 7-10 are the displacement field 862A, and it works the same as thelegacy 32-bit displacement (disp32) and works at byte granularity.

Displacement factor field 862B (Byte 7)—when MOD field 942 contains 01,byte 7 is the displacement factor field 862B. The location of this fieldis that same as that of the legacy ×86 instruction set 8-bitdisplacement (disp8), which works at byte granularity. Since disp8 issign extended, it can only address between -128 and 127 bytes offsets;in terms of 64 byte cache lines, disp8 uses 8 bits that can be set toonly four really useful values -128, -64, 0, and 64; since a greaterrange is often needed, disp32 is used; however, disp32 requires 4 bytes.In contrast to disp8 and disp32, the displacement factor field 862B is areinterpretation of disp8; when using displacement factor field 862B,the actual displacement is determined by the content of the displacementfactor field multiplied by the size of the memory operand access (N).This type of displacement is referred to as disp8*N. This reduces theaverage instruction length (a single byte of used for the displacementbut with a much greater range). Such compressed displacement is based onthe assumption that the effective displacement is multiple of thegranularity of the memory access, and hence, the redundant low-orderbits of the address offset do not need to be encoded. In other words,the displacement factor field 862B substitutes the legacy ×86instruction set 8-bit displacement. Thus, the displacement factor field862B is encoded the same way as an ×86 instruction set 8-bitdisplacement (so no changes in the ModRM/SIB encoding rules) with theonly exception that disp8 is overloaded to disp8*N. In other words,there are no changes in the encoding rules or encoding lengths but onlyin the interpretation of the displacement value by hardware (which needsto scale the displacement by the size of the memory operand to obtain abyte-wise address offset). Immediate field 872 operates as previouslydescribed.

Full Opcode Field

FIG. 9B is a block diagram illustrating the fields of the specificvector friendly instruction format 900 that make up the full opcodefield 874 according to one embodiment of the invention. Specifically,the full opcode field 874 includes the format field 840, the baseoperation field 842, and the data element width (W) field 864. The baseoperation field 842 includes the prefix encoding field 925, the opcodemap field 915, and the real opcode field 930.

Register Index Field

FIG. 9C is a block diagram illustrating the fields of the specificvector friendly instruction format 900 that make up the register indexfield 844 according to one embodiment of the invention. Specifically,the register index field 844 includes the REX field 905, the REX′ field910, the MODR/M.reg field 944, the MODR/M.r/m field 946, the VVVV field920, xxx field 954, and the bbb field 956.

Augmentation Operation Field

FIG. 9D is a block diagram illustrating the fields of the specificvector friendly instruction format 900 that make up the augmentationoperation field 850 according to one embodiment of the invention. Whenthe class (U) field 868 contains 0, it signifies EVEX.U0 (class A 868A);when it contains 1, it signifies EVEX.U1 (class B 868B). When U=0 andthe MOD field 942 contains 11 (signifying a no memory access operation),the alpha field 852 (EVEX byte 3, bit [7]-EH) is interpreted as the rsfield 852A. When the rs field 852A contains a 1 (round 852A.1), the betafield 854 (EVEX byte 3, bits [6:4]-SSS) is interpreted as the roundcontrol field 854A. The round control field 854A includes a one bit SAEfield 856 and a two bit round operation field 858. When the rs field852A contains a 0 (data transform 852A.2), the beta field 854 (EVEX byte3, bits [6:4]-SSS) is interpreted as a three bit data transform field854B. When U=0 and the MOD field 942 contains 00, 01, or 10 (signifyinga memory access operation), the alpha field 852 (EVEX byte 3, bit[7]-EH) is interpreted as the eviction hint (EH) field 852B and the betafield 854 (EVEX byte 3, bits [6:4]-SSS) is interpreted as a three bitdata manipulation field 854C.

When U=1, the alpha field 852 (EVEX byte 3, bit [7]-EH) is interpretedas the write mask control (Z) field 852C. When U=1 and the MOD field 942contains 11 (signifying a no memory access operation), part of the betafield 854 (EVEX byte 3, bit [4]-So) is interpreted as the RL field 857A;when it contains a 1 (round 857A.1) the rest of the beta field 854 (EVEXbyte 3, bit [6-5]-S₂₋₁) is interpreted as the round operation field859A, while when the RL field 857A contains a 0 (VSIZE 857.A2) the restof the beta field 854 (EVEX byte 3, bit [6-5]-S₂₋₁) is interpreted asthe vector length field 859B (EVEX byte 3, bit [6-5]-L₁₋₀). When U=1 andthe MOD field 942 contains 00, 01, or 10 (signifying a memory accessoperation), the beta field 854 (EVEX byte 3, bits [6:4]-SSS) isinterpreted as the vector length field 859B (EVEX byte 3, bit[6-5]-L₁₋₀) and the broadcast field 857B (EVEX byte 3, bit [4]-B).

Exemplary Register Architecture

FIG. 10 is a block diagram of a register architecture 1000 according toone embodiment of the invention. In the embodiment illustrated, thereare 32 vector registers 1010 that are 512 bits wide; these registers arereferenced as zmm0 through zmm31. The lower order 256 bits of the lower16 zmm registers are overlaid on registers ymm0-16. The lower order 128bits of the lower 16 zmm registers (the lower order 128 bits of the ymmregisters) are overlaid on registers xmm0-15. The specific vectorfriendly instruction format 900 operates on these overlaid register fileas illustrated in the below tables.

Adjustable Vector Length Class Operations Registers InstructionTemplates A (FIG. 810, 815, zmm registers that do not include the 8A; U= 0) 825, 830 (the vector vector length field 859B length is 64 byte) B(FIG. 812 zmm registers 8B; U = 1) (the vector length is 64 byte)Instruction templates B (FIG. 817, 827 zmm, ymm, that do include the 8B;U = 1) or xmm registers vector length field 859B (the vector length is64 byte, 32 byte, or 16 byte) depending on the vector length field 859B

In other words, the vector length field 859B selects between a maximumlength and one or more other shorter lengths, where each such shorterlength is half the length of the preceding length; and instructionstemplates without the vector length field 859B operate on the maximumvector length. Further, in one embodiment, the class B instructiontemplates of the specific vector friendly instruction format 900 operateon packed or scalar single/double-precision floating point data andpacked or scalar integer data. Scalar operations are operationsperformed on the lowest order data element position in an zmm/ymm/xmmregister; the higher order data element positions are either left thesame as they were prior to the instruction or zeroed depending on theembodiment.

Write mask registers 1015—in the embodiment illustrated, there are 8write mask registers (k0 through k7), each 64 bits in size. In analternate embodiment, the write mask registers 1015 are 16 bits in size.As previously described, in one embodiment of the invention, the vectormask register k0 cannot be used as a write mask; when the encoding thatwould normally indicate k0 is used for a write mask, it selects ahardwired write mask of 0×FFFF, effectively disabling write masking forthat instruction.

General-purpose registers 1025—in the embodiment illustrated, there aresixteen 64-bit general-purpose registers that are used along with theexisting ×86 addressing modes to address memory operands. Theseregisters are referenced by the names RAX, RBX, RCX, RDX, RBP, RSI, RDI,RSP, and R8 through r15.

Scalar floating point stack register file (×87 stack) 1045, on which isaliased the MMX packed integer flat register file 1050—in the embodimentillustrated, the ×87 stack is an eight-element stack used to performscalar floating-point operations on 32/64/80-bit floating point datausing the ×87 instruction set extension; while the MMX registers areused to perform operations on 64-bit packed integer data, as well as tohold operands for some operations performed between the MMX and XMMregisters.

Alternative embodiments of the invention may use wider or narrowerregisters. Additionally, alternative embodiments of the invention mayuse more, less, or different register files and registers.

Exemplary Core Architectures, Processors, and Computer Architectures

Processor cores may be implemented in different ways, for differentpurposes, and in different processors. For instance, implementations ofsuch cores may include: 1) a general purpose in-order core intended forgeneral-purpose computing; 2) a high performance general purposeout-of-order core intended for general-purpose computing; 3) a specialpurpose core intended primarily for graphics and/or scientific(throughput) computing. Implementations of different processors mayinclude: 1) a CPU including one or more general purpose in-order coresintended for general-purpose computing and/or one or more generalpurpose out-of-order cores intended for general-purpose computing; and2) a coprocessor including one or more special purpose cores intendedprimarily for graphics and/or scientific (throughput). Such differentprocessors lead to different computer system architectures, which mayinclude: 1) the coprocessor on a separate chip from the CPU; 2) thecoprocessor on a separate die in the same package as a CPU; 3) thecoprocessor on the same die as a CPU (in which case, such a coprocessoris sometimes referred to as special purpose logic, such as integratedgraphics and/or scientific (throughput) logic, or as special purposecores); and 4) a system on a chip that may include on the same die thedescribed CPU (sometimes referred to as the application core(s) orapplication processor(s)), the above described coprocessor, andadditional functionality. Exemplary core architectures are describednext, followed by descriptions of exemplary processors and computerarchitectures.

Exemplary Core Architectures In-Order and Out-of-Order Core BlockDiagram

FIG. 11A is a block diagram illustrating both an exemplary in-orderpipeline and an exemplary register renaming, out-of-orderissue/execution pipeline according to embodiments of the invention. FIG.11B is a block diagram illustrating both an exemplary embodiment of anin-order architecture core and an exemplary register renaming,out-of-order issue/execution architecture core to be included in aprocessor according to embodiments of the invention. The solid linedboxes in FIGS. 11A-B illustrate the in-order pipeline and in-order core,while the optional addition of the dashed lined boxes illustrates theregister renaming, out-of-order issue/execution pipeline and core. Giventhat the in-order aspect is a subset of the out-of-order aspect, theout-of-order aspect will be described.

In FIG. 11A, a processor pipeline 1100 includes a fetch stage 1102, alength decode stage 1104, a decode stage 1106, an allocation stage 1108,a renaming stage 1110, a scheduling (also known as a dispatch or issue)stage 1112, a register read/memory read stage 1114, an execute stage1116, a write back/memory write stage 1118, an exception handling stage1122, and a commit stage 1124.

FIG. 11B shows processor core 1190 including a front end unit 1130coupled to an execution engine unit 1150, and both are coupled to amemory unit 1170. The core 1190 may be a reduced instruction setcomputing (RISC) core, a complex instruction set computing (CISC) core,a very long instruction word (VLIW) core, or a hybrid or alternativecore type. As yet another option, the core 1190 may be a special-purposecore, such as, for example, a network or communication core, compressionengine, coprocessor core, general purpose computing graphics processingunit (GPGPU) core, graphics core, or the like.

The front end unit 1130 includes a branch prediction unit 1132 coupledto an instruction cache unit 1134, which is coupled to an instructiontranslation lookaside buffer (TLB) 1136, which is coupled to aninstruction fetch unit 1138, which is coupled to a decode unit 1140. Thedecode unit 1140 (or decoder) may decode instructions, and generate asan output one or more micro-operations, micro-code entry points,microinstructions, other instructions, or other control signals, whichare decoded from, or which otherwise reflect, or are derived from, theoriginal instructions. The decode unit 1140 may be implemented usingvarious different mechanisms. Examples of suitable mechanisms include,but are not limited to, look-up tables, hardware implementations,programmable logic arrays (PLAs), microcode read only memories (ROMs),etc. In one embodiment, the core 1190 includes a microcode ROM or othermedium that stores microcode for certain macroinstructions (e.g., indecode unit 1140 or otherwise within the front end unit 1130). Thedecode unit 1140 is coupled to a rename/allocator unit 1152 in theexecution engine unit 1150.

The execution engine unit 1150 includes the rename/allocator unit 1152coupled to a retirement unit 1154 and a set of one or more schedulerunit(s) 1156. The scheduler unit(s) 1156 represents any number ofdifferent schedulers, including reservations stations, centralinstruction window, etc. The scheduler unit(s) 1156 is coupled to thephysical register file(s) unit(s) 1158. Each of the physical registerfile(s) units 1158 represents one or more physical register files,different ones of which store one or more different data types, such asscalar integer, scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point, status (e.g., aninstruction pointer that is the address of the next instruction to beexecuted), etc. In one embodiment, the physical register file(s) unit1158 comprises a vector registers unit, a write mask registers unit, anda scalar registers unit. These register units may provide architecturalvector registers, vector mask registers, and general purpose registers.The physical register file(s) unit(s) 1158 is overlapped by theretirement unit 1154 to illustrate various ways in which registerrenaming and out-of-order execution may be implemented (e.g., using areorder buffer(s) and a retirement register file(s); using a futurefile(s), a history buffer(s), and a retirement register file(s); using aregister maps and a pool of registers; etc.). The retirement unit 1154and the physical register file(s) unit(s) 1158 are coupled to theexecution cluster(s) 1160. The execution cluster(s) 1160 includes a setof one or more execution units 1162 and a set of one or more memoryaccess units 1164. The execution units 1162 may perform variousoperations (e.g., shifts, addition, subtraction, multiplication) and onvarious types of data (e.g., scalar floating point, packed integer,packed floating point, vector integer, vector floating point). Whilesome embodiments may include a number of execution units dedicated tospecific functions or sets of functions, other embodiments may includeonly one execution unit or multiple execution units that all perform allfunctions. The scheduler unit(s) 1156, physical register file(s) unit(s)1158, and execution cluster(s) 1160 are shown as being possibly pluralbecause certain embodiments create separate pipelines for certain typesof data/operations (e.g., a scalar integer pipeline, a scalar floatingpoint/packed integer/packed floating point/vector integer/vectorfloating point pipeline, and/or a memory access pipeline that each havetheir own scheduler unit, physical register file(s) unit, and/orexecution cluster—and in the case of a separate memory access pipeline,certain embodiments are implemented in which only the execution clusterof this pipeline has the memory access unit(s) 1164). It should also beunderstood that where separate pipelines are used, one or more of thesepipelines may be out-of-order issue/execution and the rest in-order.

The set of memory access units 1164 is coupled to the memory unit 1170,which includes a data TLB unit 1172 coupled to a data cache unit 1174coupled to a level 2 (L2) cache unit 1176. In one exemplary embodiment,the memory access units 1164 may include a load unit, a store addressunit, and a store data unit, each of which is coupled to the data TLBunit 1172 in the memory unit 1170. The instruction cache unit 1134 isfurther coupled to a level 2 (L2) cache unit 1176 in the memory unit1170. The L2 cache unit 1176 is coupled to one or more other levels ofcache and eventually to a main memory.

By way of example, the exemplary register renaming, out-of-orderissue/execution core architecture may implement the pipeline 1100 asfollows: 1) the instruction fetch 1138 performs the fetch and lengthdecoding stages 1102 and 1104; 2) the decode unit 1140 performs thedecode stage 1106; 3) the rename/allocator unit 1152 performs theallocation stage 1108 and renaming stage 1110; 4) the scheduler unit(s)1156 performs the schedule stage 1112; 5) the physical register file(s)unit(s) 1158 and the memory unit 1170 perform the register read/memoryread stage 1114; the execution cluster 1160 perform the execute stage1116; 6) the memory unit 1170 and the physical register file(s) unit(s)1158 perform the write back/memory write stage 1118; 7) various unitsmay be involved in the exception handling stage 1122; and 8) theretirement unit 1154 and the physical register file(s) unit(s) 1158perform the commit stage 1124.

The core 1190 may support one or more instructions sets (e.g., the ×86instruction set (with some extensions that have been added with newerversions); the MIPS instruction set of MIPS Technologies of Sunnyvale,Calif.; the ARM instruction set (with optional additional extensionssuch as NEON) of ARM Holdings of Sunnyvale, Calif.), including theinstruction(s) described herein. In one embodiment, the core 1190includes logic to support a packed data instruction set extension (e.g.,AVX1, AVX2), thereby allowing the operations used by many multimediaapplications to be performed using packed data.

It should be understood that the core may support multithreading(executing two or more parallel sets of operations or threads), and maydo so in a variety of ways including time sliced multithreading,simultaneous multithreading (where a single physical core provides alogical core for each of the threads that physical core issimultaneously multithreading), or a combination thereof (e.g., timesliced fetching and decoding and simultaneous multithreading thereaftersuch as in the Intel® Hyperthreading technology).

While register renaming is described in the context of out-of-orderexecution, it should be understood that register renaming may be used inan in-order architecture. While the illustrated embodiment of theprocessor also includes separate instruction and data cache units1134/1174 and a shared L2 cache unit 1176, alternative embodiments mayhave a single internal cache for both instructions and data, such as,for example, a Level 1 (L1) internal cache, or multiple levels ofinternal cache. In some embodiments, the system may include acombination of an internal cache and an external cache that is externalto the core and/or the processor. Alternatively, all of the cache may beexternal to the core and/or the processor.

Specific Exemplary In-Order Core Architecture

FIGS. 12A-B illustrate a block diagram of a more specific exemplaryin-order core architecture, which core would be one of several logicblocks (including other cores of the same type and/or different types)in a chip. The logic blocks communicate through a high-bandwidthinterconnect network (e.g., a ring network) with some fixed functionlogic, memory I/O interfaces, and other necessary I/O logic, dependingon the application.

FIG. 12A is a block diagram of a single processor core, along with itsconnection to the on-die interconnect network 1202 and with its localsubset of the Level 2 (L2) cache 1204, according to embodiments of theinvention. In one embodiment, an instruction decoder 1200 supports the×86 instruction set with a packed data instruction set extension. An L1cache 1206 allows low-latency accesses to cache memory into the scalarand vector units. While in one embodiment (to simplify the design), ascalar unit 1208 and a vector unit 1210 use separate register sets(respectively, scalar registers 1212 and vector registers 1214) and datatransferred between them is written to memory and then read back in froma level 1 (L1) cache 1206, alternative embodiments of the invention mayuse a different approach (e.g., use a single register set or include acommunication path that allow data to be transferred between the tworegister files without being written and read back).

The local subset of the L2 cache 1204 is part of a global L2 cache thatis divided into separate local subsets, one per processor core. Eachprocessor core has a direct access path to its own local subset of theL2 cache 1204. Data read by a processor core is stored in its L2 cachesubset 1204 and can be accessed quickly, in parallel with otherprocessor cores accessing their own local L2 cache subsets. Data writtenby a processor core is stored in its own L2 cache subset 1204 and isflushed from other subsets, if necessary. The ring network ensurescoherency for shared data. The ring network is bi-directional to allowagents such as processor cores, L2 caches and other logic blocks tocommunicate with each other within the chip. Each ring data-path is1012-bits wide per direction.

FIG. 12B is an expanded view of part of the processor core in FIG. 12Aaccording to embodiments of the invention. FIG. 12B includes an L1 datacache 1206A part of the L1 cache 1204, as well as more detail regardingthe vector unit 1210 and the vector registers 1214. Specifically, thevector unit 1210 is a 16-wide vector processing unit (VPU) (see the16-wide ALU 1228), which executes one or more of integer,single-precision float, and double-precision float instructions. The VPUsupports swizzling the register inputs with swizzle unit 1220, numericconversion with numeric convert units 1222A-B, and replication withreplication unit 1224 on the memory input. Write mask registers 1226allow predicating resulting vector writes.

FIG. 13 is a block diagram of a processor 1300 that may have more thanone core, may have an integrated memory controller, and may haveintegrated graphics according to embodiments of the invention. The solidlined boxes in FIG. 13 illustrate a processor 1300 with a single core1302A, a system agent 1310, a set of one or more bus controller units1316, while the optional addition of the dashed lined boxes illustratesan alternative processor 1300 with multiple cores 1302A-N, a set of oneor more integrated memory controller unit(s) 1314 in the system agentunit 1310, and special purpose logic 1308.

Thus, different implementations of the processor 1300 may include: 1) aCPU with the special purpose logic 1308 being integrated graphics and/orscientific (throughput) logic (which may include one or more cores), andthe cores 1302A-N being one or more general purpose cores (e.g., generalpurpose in-order cores, general purpose out-of-order cores, acombination of the two); 2) a coprocessor with the cores 1302A-N being alarge number of special purpose cores intended primarily for graphicsand/or scientific (throughput); and 3) a coprocessor with the cores1302A-N being a large number of general purpose in-order cores. Thus,the processor 1300 may be a general-purpose processor, coprocessor orspecial-purpose processor, such as, for example, a network orcommunication processor, compression engine, graphics processor, GPGPU(general purpose graphics processing unit), a high-throughput manyintegrated core (MIC) coprocessor (including 30 or more cores), embeddedprocessor, or the like. The processor may be implemented on one or morechips. The processor 1300 may be a part of and/or may be implemented onone or more substrates using any of a number of process technologies,such as, for example, BiCMOS, CMOS, or NMOS.

The memory hierarchy includes one or more levels of cache 1304A-N withinthe cores, a set or one or more shared cache units 1306, and externalmemory (not shown) coupled to the set of integrated memory controllerunits 1314. The set of shared cache units 1306 may include one or moremid-level caches, such as level 2 (L2), level 3 (L3), level 4 (L4), orother levels of cache, a last level cache (LLC), and/or combinationsthereof. While in one embodiment a ring based interconnect unit 1312interconnects the integrated graphics logic 1308, the set of sharedcache units 1306, and the system agent unit 1310/integrated memorycontroller unit(s) 1314, alternative embodiments may use any number ofwell-known techniques for interconnecting such units. In one embodiment,coherency is maintained between one or more cache units 1306 and cores1302A-N.

In some embodiments, one or more of the cores 1302A-N are capable ofmulti-threading. The system agent 1310 includes those componentscoordinating and operating cores 1302A-N. The system agent unit 1310 mayinclude for example a power control unit (PCU) and a display unit. ThePCU may be or include logic and components needed for regulating thepower state of the cores 1302A-N and the integrated graphics logic 1308.The display unit is for driving one or more externally connecteddisplays.

The cores 1302A-N may be homogenous or heterogeneous in terms ofarchitecture instruction set; that is, two or more of the cores 1302A-Nmay be capable of execution the same instruction set, while others maybe capable of executing only a subset of that instruction set or adifferent instruction set.

Exemplary Computer Architectures

FIGS. 14-16 are block diagrams of exemplary computer architectures.Other system designs and configurations known in the arts for laptops,desktops, handheld PCs, personal digital assistants, engineeringworkstations, servers, network devices, network hubs, switches, embeddedprocessors, digital signal processors (DSPs), graphics devices, videogame devices, set-top boxes, micro controllers, cell phones, portablemedia players, hand held devices, and various other electronic devices,are also suitable. In general, a huge variety of systems or electronicdevices capable of incorporating a processor and/or other executionlogic as disclosed herein are generally suitable.

Referring now to FIG. 14, shown is a block diagram of a system 1400 inaccordance with one embodiment of the present invention. The system 1400may include one or more processors 1410, 1415, which are coupled to acontroller hub 1420. In one embodiment the controller hub 1420 includesa graphics memory controller hub (GMCH) 1490 and an Input/Output Hub(IOH) 1450 (which may be on separate chips); the GMCH 1490 includesmemory and graphics controllers to which are coupled memory 1440and acoprocessor 1445; the IOH 1450 is couples input/output (I/O) devices1460 to the GMCH 1490. Alternatively, one or both of the memory andgraphics controllers are integrated within the processor (as describedherein), the memory 1440 and the coprocessor 1445 are coupled directlyto the processor 1410, and the controller hub 1420 in a single chip withthe IOH 1450.

The optional nature of additional processors 1415 is denoted in FIG. 14with broken lines. Each processor 1410, 1415 may include one or more ofthe processing cores described herein and may be some version of theprocessor 1300.

The memory 1440 may be, for example, dynamic random access memory(DRAM), phase change memory (PCM), or a combination of the two. For atleast one embodiment, the controller hub 1420 communicates with theprocessor(s) 1410, 1415 via a multi-drop bus, such as a frontside bus(FSB), point-to-point interface such as QuickPath Interconnect (QPI), orsimilar connection 1495.

In one embodiment, the coprocessor 1445 is a special-purpose processor,such as, for example, a high-throughput MIC processor, a network orcommunication processor, compression engine, graphics processor, GPGPU,embedded processor, or the like. In one embodiment, controller hub 1420may include an integrated graphics accelerator.

There can be a variety of differences between the physical resources1410, 1415 in terms of a spectrum of metrics of merit includingarchitectural, microarchitectural, thermal, power consumptioncharacteristics, and the like.

In one embodiment, the processor 1410 executes instructions that controldata processing operations of a general type. Embedded within theinstructions may be coprocessor instructions. The processor 1410recognizes these coprocessor instructions as being of a type that shouldbe executed by the attached coprocessor 1445. Accordingly, the processor1410 issues these coprocessor instructions (or control signalsrepresenting coprocessor instructions) on a coprocessor bus or otherinterconnect, to coprocessor 1445. Coprocessor(s) 1445 accept andexecute the received coprocessor instructions.

Referring now to FIG. 15, shown is a block diagram of a first morespecific exemplary system 1500 in accordance with an embodiment of thepresent invention. As shown in FIG. 15, multiprocessor system 1500 is apoint-to-point interconnect system, and includes a first processor 1570and a second processor 1580 coupled via a point-to-point interconnect1550. Each of processors 1570 and 1580 may be some version of theprocessor 1300. In one embodiment of the invention, processors 1570 and1580 are respectively processors 1410 and 1415, while coprocessor 1538is coprocessor 1445. In another embodiment, processors 1570 and 1580 arerespectively processor 1410 coprocessor 1445.

Processors 1570 and 1580 are shown including integrated memorycontroller (IMC) units 1572 and 1582, respectively. Processor 1570 alsoincludes as part of its bus controller units point-to-point (P-P)interfaces 1576 and 1578; similarly, second processor 1580 includes P-Pinterfaces 1586 and 1588. Processors 1570, 1580 may exchange informationvia a point-to-point (P-P) interface 1550 using P-P interface circuits1578, 1588. As shown in FIG. 15, IMCs 1572 and 1582 couple theprocessors to respective memories, namely a memory 1532 and a memory1534, which may be portions of main memory locally attached to therespective processors.

Processors 1570, 1580 may each exchange information with a chipset 1590via individual P-P interfaces 1552, 1554 using point to point interfacecircuits 1576, 1594, 1586, 1598. Chipset 1590 may optionally exchangeinformation with the coprocessor 1538 via a high-performance interface1592. In one embodiment, the coprocessor 1538 is a special-purposeprocessor, such as, for example, a high-throughput MIC processor, anetwork or communication processor, compression engine, graphicsprocessor, GPGPU, embedded processor, or the like.

A shared cache (not shown) may be included in either processor oroutside of both processors, yet connected with the processors via P-Pinterconnect, such that either or both processors' local cacheinformation may be stored in the shared cache if a processor is placedinto a low power mode.

Chipset 1590 may be coupled to a first bus 1516 via an interface 1596.In one embodiment, first bus 1516 may be a Peripheral ComponentInterconnect (PCI) bus, or a bus such as a PCI Express bus or anotherthird generation I/O interconnect bus, although the scope of the presentinvention is not so limited.

As shown in FIG. 15, various I/O devices 1514 may be coupled to firstbus 1516, along with a bus bridge 1518 which couples first bus 1516 to asecond bus 1520. In one embodiment, one or more additional processor(s)1515, such as coprocessors, high-throughput MIC processors, GPGPU's,accelerators (such as, e.g., graphics accelerators or digital signalprocessing (DSP) units), field programmable gate arrays, or any otherprocessor, are coupled to first bus 1516. In one embodiment, second bus1520 may be a low pin count (LPC) bus. Various devices may be coupled toa second bus 1520 including, for example, a keyboard and/or mouse 1522,communication devices 1527 and a storage unit 1528 such as a disk driveor other mass storage device which may include instructions/code anddata 1530, in one embodiment. Further, an audio I/O 1524 may be coupledto the second bus 1520. Note that other architectures are possible. Forexample, instead of the point-to-point architecture of FIG. 15, a systemmay implement a multi-drop bus or other such architecture.

Referring now to FIG. 16, shown is a block diagram of a second morespecific exemplary system 1600 in accordance with an embodiment of thepresent invention. Like elements in FIGS. 15 and 16 bear like referencenumerals, and certain aspects of FIG. 15 have been omitted from FIG. 16in order to avoid obscuring other aspects of FIG. 16.

FIG. 16 illustrates that the processors 1570, 1580 may includeintegrated memory and I/O control logic (“CL”) 1572 and 1582,respectively. Thus, the CL 1572, 1582 include integrated memorycontroller units and include I/O control logic. FIG. 16 illustrates thatnot only are the memories 1532, 1534 coupled to the CL 1572, 1582, butalso that I/O devices 1614 are also coupled to the control logic 1572,1582. Legacy I/O devices 1615 are coupled to the chipset 1590.

Referring now to FIG. 16, shown is a block diagram of a SoC 1600 inaccordance with an embodiment of the present invention. Similar elementsin FIG. 13 bear like reference numerals. Also, dashed lined boxes areoptional features on more advanced SoCs. In FIG. 16, an interconnectunit(s) 1602 is coupled to: an application processor 1610 which includesa set of one or more cores 1302A-N, cache 1304A-N, and shared cacheunit(s) 1306; a system agent unit 1310; a bus controller unit(s) 1316;an integrated memory controller unit(s) 1314; a set or one or morecoprocessors 1620 which may include integrated graphics logic, an imageprocessor, an audio processor, and a video processor; an static randomaccess memory (SRAM) unit 1630; a direct memory access (DMA) unit 1632;and a display unit 1640 for coupling to one or more external displays.In one embodiment, the coprocessor(s) 1620 include a special-purposeprocessor, such as, for example, a network or communication processor,compression engine, GPGPU, a high-throughput MIC processor, embeddedprocessor, or the like.

Embodiments of the mechanisms disclosed herein may be implemented inhardware, software, firmware, or a combination of such implementationapproaches. Embodiments of the invention may be implemented as computerprograms or program code executing on programmable systems comprising atleast one processor, a storage system (including volatile andnon-volatile memory and/or storage elements), at least one input device,and at least one output device.

Program code, such as code 1530 illustrated in FIG. 15, may be appliedto input instructions to perform the functions described herein andgenerate output information. The output information may be applied toone or more output devices, in known fashion. For purposes of thisapplication, a processing system includes any system that has aprocessor, such as, for example; a digital signal processor (DSP), amicrocontroller, an application specific integrated circuit (ASIC), or amicroprocessor.

The program code may be implemented in a high level procedural or objectoriented programming language to communicate with a processing system.The program code may also be implemented in assembly or machinelanguage, if desired. In fact, the mechanisms described herein are notlimited in scope to any particular programming language. In any case,the language may be a compiled or interpreted language.

One or more aspects of at least one embodiment may be implemented byrepresentative instructions stored on a machine-readable medium whichrepresents various logic within the processor, which when read by amachine causes the machine to fabricate logic to perform the techniquesdescribed herein. Such representations, known as “IP cores” may bestored on a tangible, machine readable medium and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor.

Such machine-readable storage media may include, without limitation,non-transitory, tangible arrangements of articles manufactured or formedby a machine or device, including storage media such as hard disks, anyother type of disk including floppy disks, optical disks, compact diskread-only memories (CD-ROMs), compact disk rewritable's (CD-RWs), andmagneto-optical disks, semiconductor devices such as read-only memories(ROMs), random access memories (RAMS) such as dynamic random accessmemories (DRAMs), static random access memories (SRAMs), erasableprogrammable read-only memories (EPROMs), flash memories, electricallyerasable programmable read-only memories (EEPROMs), phase change memory(PCM), magnetic or optical cards, or any other type of media suitablefor storing electronic instructions.

Accordingly, embodiments of the invention also include non-transitory,tangible machine-readable media containing instructions or containingdesign data, such as Hardware Description Language (HDL), which definesstructures, circuits, apparatuses, processors and/or system featuresdescribed herein. Such embodiments may also be referred to as programproducts.

Emulation (Including Binary Translation, Code Morphing, etc.)

In some cases, an instruction converter may be used to convert aninstruction from a source instruction set to a target instruction set.For example, the instruction converter may translate (e.g., using staticbinary translation, dynamic binary translation including dynamiccompilation), morph, emulate, or otherwise convert an instruction to oneor more other instructions to be processed by the core. The instructionconverter may be implemented in software, hardware, firmware, or acombination thereof. The instruction converter may be on processor, offprocessor, or part on and part off processor.

FIG. 17 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to embodimentsof the invention. In the illustrated embodiment, the instructionconverter is a software instruction converter, although alternativelythe instruction converter may be implemented in software, firmware,hardware, or various combinations thereof. FIG. 17 shows a program in ahigh level language 1702 may be compiled using an ×86 compiler 1704 togenerate ×86 binary code 1706 that may be natively executed by aprocessor with at least one ×86 instruction set core 1716. The processorwith at least one ×86 instruction set core 1716 represents any processorthat can perform substantially the same functions as an Intel processorwith at least one ×86 instruction set core by compatibly executing orotherwise processing (1) a substantial portion of the instruction set ofthe Intel ×86 instruction set core or (2) object code versions ofapplications or other software targeted to run on an Intel processorwith at least one ×86 instruction set core, in order to achievesubstantially the same result as an Intel processor with at least one×86 instruction set core. The ×86 compiler 1704 represents a compilerthat is operable to generate ×86 binary code 1706 (e.g., object code)that can, with or without additional linkage processing, be executed onthe processor with at least one ×86 instruction set core 1716.Similarly, FIG. 17 shows the program in the high level language 1702 maybe compiled using an alternative instruction set compiler 1708 togenerate alternative instruction set binary code 1710 that may benatively executed by a processor without at least one ×86 instructionset core 1714 (e.g., a processor with cores that execute the MIPSinstruction set of MIPS Technologies of Sunnyvale, Calif. and/or thatexecute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.).The instruction converter 1712 is used to convert the ×86 binary code1706 into code that may be natively executed by the processor without an×86 instruction set core 1714. This converted code is not likely to bethe same as the alternative instruction set binary code 1710 because aninstruction converter capable of this is difficult to make; however, theconverted code will accomplish the general operation and be made up ofinstructions from the alternative instruction set. Thus, the instructionconverter 1712 represents software, firmware, hardware, or a combinationthereof that, through emulation, simulation or any other process, allowsa processor or other electronic device that does not have an ×86instruction set processor or core to execute the ×86 binary code 1706.

1. An apparatus comprising: a decoder circuit to decode an instruction,wherein the instruction to include at least an opcode, a field for atleast two packed data source operands, a field for a packed datadestination operand, and an immediate; and execution circuitry toexecute the decoded instruction to load packed data elements from the atleast two packed data source operands using a stride and storing resultsof the strided loads in the packed data destination operand startingfrom a defined position determined in part from the immediate.
 2. Theapparatus of claim 1, wherein the packed data source operands areconcatenated.
 3. The apparatus of claim 2, wherein the defined positionis determined by a round value provided by the immediate, a number ofpacked data elements in each of the packed data source operands, anoffset provided by the immediate, the number of packed data sourceoperands, and the stride determined from the immediate.
 4. The apparatusof claim 3, wherein the stride is a value from the immediate plus
 1. 5.The apparatus of claim 3, wherein the defined position is the roundmultiplied by the number of packed data elements in each of the packeddata source operand multiplied be the number of packed data sourceoperands plus an offset, wherein this value is divided by the stride. 6.The apparatus of claim 1, wherein the instruction to include a field fora writemask operand.
 7. The apparatus of claim 6, wherein the executioncircuitry to store a result of the strided loads based on values of thewritemask operand.
 8. An method comprising: decoding an instruction,wherein the instruction to include at least an opcode, a field for atleast two packed data source operands, a field for a packed datadestination operand, and an immediate; and executing the decodedinstruction to load packed data elements from the at least two packeddata source operands using a stride and storing results of the stridedloads in the packed data destination operand starting from a definedposition determined in part from the immediate.
 9. The method of claim8, wherein the packed data source operands are concatenated.
 10. Themethod of claim 9, wherein the defined position is determined by a roundvalue provided by the immediate, a number of packed data elements ineach of the packed data source operands, an offset provided by theimmediate, the number of packed data source operands, and the stridedetermined from the immediate.
 11. The method of claim 9, wherein thestride is a value from the immediate plus
 1. 12. The method of claim 9,wherein the defined position is the round multiplied by the number ofpacked data elements in each of the packed data source operandmultiplied be the number of packed data source operands plus an offset,wherein this value is divided by the stride.
 13. The method of claim 8,wherein the instruction to include a field for a writemask operand. 14.The method of claim 13, wherein the storing is based on values of thewritemask operand.
 15. A non-transitory machine-readable medium storinginstructions which when executed to cause a processor to perform amethod, the method comprising: decoding an instruction, wherein theinstruction to include at least an opcode, a field for at least twopacked data source operands, a field for a packed data destinationoperand, and an immediate; and executing the decoded instruction to loadpacked data elements from the at least two packed data source operandsusing a stride and storing results of the strided loads in the packeddata destination operand starting from a defined position determined inpart from the immediate.
 16. The non-transitory machine-readable mediumof claim 15, wherein the packed data source operands are concatenated.17. The non-transitory machine-readable medium of claim 16, wherein thedefined position is determined by a round value provided by theimmediate, a number of packed data elements in each of the packed datasource operands, an offset provided by the immediate, the number ofpacked data source operands, and the stride determined from theimmediate.
 18. The non-transitory machine-readable medium of claim 16,wherein the stride is a value from the immediate plus
 1. 19. Thenon-transitory machine-readable medium of claim 16, wherein the definedposition is the round multiplied by the number of packed data elementsin each of the packed data source operand multiplied be the number ofpacked data source operands plus an offset, wherein this value isdivided by the stride.
 20. The non-transitory machine-readable medium ofclaim 15, wherein the instruction to include a field for a writemaskoperand and the storing is based on values of the writemask operand.